A Pragmatic Approach to Reuse in Tactical Theorem Proving

A Pragmatic Approach to Reuse in Tactical Theorem Proving

In interactive theorem proving, tactics and tacticals have been introduced to automate proof search. In this scenario, user interaction traditionally is restricted to the mode in which the user decides which tactic to apply on the top-level, without being able to interact with the tactic once it has begun running. We propose a technique to allow the implementation of derivational analogy in tac...

Bellerophon: Tactical Theorem Proving for Hybrid Systems

Hybrid systems combine discrete and continuous dynamics, which makes them attractive as models for systems that combine computer control with physical motion. Verification is undecidable for hybrid systems and challenging for many models and properties of practical interest. Thus, human interaction and insight are essential for verification. Interactive theorem provers seek to increase user pro...

Termination of Theorem Proving by Reuse

We investigate the improvement of theorem provers by re-using previously computed proofs. We formulate our method for reusing proofs as an instance of the problem reduction paradigm and then develop a termination requirement for our reuse procedure. We prove the soundness of our proposal and show that reusability of proofs is not spoiled by the termination requirement imposed on the reuse proce...

A Theorem-Proving approach to CLP

A Hierarchical Approach to Theorem-Proving

1. Introduction A considerable amount of recent work in theorem-proving has been concerned with methods for increasing the power of inferences which can be made in special cases. This appears to be in response to the widespread recognition that general purpose theorem provers, particularly those using resolution [10] as their inference rule, have extreme difficulty with particular aspects of pr...